Fast Computation of the Bezout and Dixon Resultant Matrices
نویسندگان
چکیده
Efficient algorithms are derived for computing the entries of the Bezout resultant matrix for two univariate polynomials of degree n and for calculating the entries of the Dixon–Cayley resultant matrix for three bivariate polynomials of bidegree (m, n). Standard methods based on explicit formulas require O(n3) additions and multiplications to compute all the entries of the Bezout resultant matrix. Here we present a new recursive algorithm for computing these entries that uses only O(n2) additions and multiplications. The improvement is even more dramatic in the bivariate setting. Established techniques based on explicit formulas require O(m4n4) additions and multiplications to calculate all the entries of the Dixon–Cayley resultant matrix. In contrast, our recursive algorithm for computing these entries uses only O(m2n3) additions and multiplications. c © 2002 Academic Press
منابع مشابه
Cayley-Dixon construction of Resultants of Multi-Univariate Composed Polynomials
The Cayley-Dixon formulation for multivariate resultants have been shown to be efficient (both experimentally and theoretically) for computing resultants by simultaneously eliminating many variables from a polynomial system. In this paper, the behavior of Cayley-Dixon resultant construction and the structure of Dixon matrices is analyzed for composed polynomial systems constructed from a multiv...
متن کاملThe Block Structure of Three Dixon Resultants and Their Accompanying Transformation Matrices
Dixon 1908] introduces three distinct determinant formulations for the resultant of three bivariate polynomials of bidegree (m; n). The rst technique applies Sylvester's dialytic method to construct the resultant as the determinant of a matrix of order 6mn. The second approach uses Cayley's determinant device to form a more compact representation for the resultant as the determinant of a matrix...
متن کاملAcm Symposium on Theory of Computing (stoc 96) Sparsity Considerations in Dixon Resultants
New results relating the sparsity of nonhomogeneous polynomial systems and computation of their projection operator (a non-trivial multiple of the multivariate resultant) using Dixon's method are developed. It is demonstrated that Dixon's method of computing resultants, despite being classical, implicitly exploits the sparse structure of input polynomials. It is proved that the size of the Dixo...
متن کاملCommunicated by Weidong Liao , Qing Wang , and Zhijun Wang DMAS : A Web - based Distributed Mathematics Assessment System
The Bezout-Dixon resultant method for solving systems of polynomial equations lends itselfto various heuristic acceleration techniques, previously reported by the present author [6], which can beextraordinarily effective. In this paper we will discuss how well these techniques apply to the Macaulayresultant. In brief, we find that they do work there with some difficulties, but the D...
متن کاملA robust solution of the generalized polynomial Bezout identity
In this paper, algorithms for the computation of all matrices of the generalized polynomial Bezout identity are proposed. The algorithms are based on the computation of minimal polynomial basis for the right null spaces of certain polynomial matrices. For this reason, an algorithm for the computation of minimal polynomial bases is also proposed. Since this algorithm relies solely on singular va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 33 شماره
صفحات -
تاریخ انتشار 2002